Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems

In this paper, an efficient hybrid genetic algorithm (HGA) and its variants for the wellknown combinatorial optimization problem, the quadratic assignment problem (QAP) are discussed. In particular, we tested our algorithms on a special type of QAPs, the structured quadratic assignment problems. The results from the computational experiments on this class of problems demonstrate that HGAs allow...

متن کامل

Tabu Search and Hybrid Genetic Algorithms for Quadratic Assignment Problems

In this chapter experience with solving quadratic assignment problems is reported. The results reported in this chapter are the best results for heuristic solutions of the quadratic assignment problem available to date and can serve as bench mark results for future researchers who propose new approaches for solving quadratic assignment problems. The most effective method to date for solving qua...

متن کامل

Quadratic Semi-Assignment Problems on Structured Graphs

The paper presents a class of polynomially solvable instances of Quadratic SemiAssignment Problem. Some properties of this class are illustrated. In the light of these results lower bounds and solution techniques for the general case are proposed. A computational comparison of some lower bounds is reported.

متن کامل

An Ant Approach for Structured Quadratic Assignment Problems

The paper presents a new heuristic method for the quadratic assignment problem. This method is based on an artificial ant system, hybridized with a fast local search. The method is easy to implement and numerical results show that it is fast and efficient for structured problems.

متن کامل

Hybrid Ant System Algorithm for Solving Quadratic Assignment Problems

-In this paper a hybrid variant of meta-heuristic algorithm ant colony optimization (ACO) is used. Approximate solutions to quadratic assignment problem have been proved very efficient. Different variants of ant colony optimization have been applied to QAP. But in this paper a hybrid approach is proposed which is combination of Ant system and Max-Min Ant system to take benefits of both the meth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informatica

سال: 2009

ISSN: 0868-4952,1822-8844

DOI: 10.15388/informatica.2009.249